Algorithms for the continuous nonlinear resource allocation problem - New implementations and numerical studies
نویسندگان
چکیده
Patriksson [Pat08] provided a then up-to-date survey on the continuous, separable, differentiable and convex resource allocation problem with a single resource constraint. Since the publication of that paper the interest in the problem has grown: several new applications have arisen where the problem at hand constitutes a subproblem, and several new algorithms have been developed for its efficient solution. This paper therefore serves three purposes. First, it provides an up-to-date extension of the survey of the literature of the field, complementing the survey in Patriksson [Pat08] with more then 20 books and articles. Second, it contributes improvements of some of these algorithms, in particular with an improvement of the pegging (that is, variable fixing) process in the relaxation algorithm, and an improved means to evaluate subsolutions. Third, it numerically evaluates several relaxation (primal) and breakpoint (dual) algorithms, incorporating a variety of pegging strategies, as well as a quasi-Newton method. Our conclusion is that our modification of the relaxation algorithm performs the best. At least for problem sizes up to 30 million variables the practical time complexity for the breakpoint and relaxation algorithms is linear.
منابع مشابه
A New Model for Location-Allocation Problem within Queuing Framework
This paper proposes a bi-objective model for the facility location problem under a congestion system. The idea of the model is motivated by applications of locating servers in bank automated teller machines (ATMS), communication networks, and so on. This model can be specifically considered for situations in which fixed service facilities are congested by stochastic demand within queueing frame...
متن کاملA New Fairness Index and Novel Approach for QoS-Aware Resource Allocation in LTE Networks Based on Utility Functions
Resource allocation techniques have recently appeared as a widely recognized feature in LTE networks. Most of existing approaches in resource allocation focus on maximizing network’s utility functions. The great potential of utility function in improving resource allocation and enhancing fairness and mean opinion score (MOS) indexes has attracted large efforts over the last few years. In this p...
متن کاملResource allocation based on DEA for distance improvement to MPSS points considering environmental factors
This paper proposes a new resource allocation model which is based on data envelopment analysis (DEA) and concerns systems with several homogeneous units operating under supervision of a central unit. The previous studies in DEA literature deal with reallocating/allocating organizational resource to improve performance or maximize the total amount of outputs produced by individual units. In tho...
متن کاملA new approach for solving fuzzy multi-objective quadratic programming of water resource allocation problem
متن کامل
A Clustering Based Location-allocation Problem Considering Transportation Costs and Statistical Properties (RESEARCH NOTE)
Cluster analysis is a useful technique in multivariate statistical analysis. Different types of hierarchical cluster analysis and K-means have been used for data analysis in previous studies. However, the K-means algorithm can be improved using some metaheuristics algorithms. In this study, we propose simulated annealing based algorithm for K-means in the clustering analysis which we refer it a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- European Journal of Operational Research
دوره 243 شماره
صفحات -
تاریخ انتشار 2015